Highly non-concurrent longest paths in lattices
نویسندگان
چکیده
منابع مشابه
Highly non-concurrent longest paths in lattices
Yasir BASHIR1,∗, Faisal NADEEM, Ayesha SHABBIR Faculty of Mathematics, COMSATS Institute of Information Technology Wah Campus, Wah Cantt, Pakistan Faculty of Mathematics, COMSATS Institute of Information Technology Lahore Campus, Lahore, Pakistan Abdus Salam School of Mathematical Sciences, GC University, 68-B, New Muslim Town, Lahore, Pakistan University College of Engineering, Sciences and Te...
متن کاملHIGHLY NON-CONCURRENT LONGEST.dvi
There exist planar graphs in which any two vertices are missed by some longest cycle. Although this requirement is very strong, we prove here that such graphs can also be found as subgraphs of the square and hexagonal lattices. Considering (finite) such lattices on the torus and on the Möbius strip enables us to reduce the order of our examples. Introduction Do we have small (if possible minima...
متن کاملTransversals of Longest Paths
Let lpt(G) be the minimum cardinality of a set of vertices that intersects all longest paths in a graph G. Let ω(G) be the size of a maximum clique in G, and tw(G) be the treewidth of G. We prove that lpt(G) ≤ max{1,ω(G)− 2} when G is a connected chordal graph; that lpt(G) = 1 when G is a connected bipartite permutation graph or a connected full substar graph; and that lpt(G) ≤ tw(G) for any co...
متن کاملLongest Paths in Circular Arc Graphs
We show that all maximum length paths in a connected circular arc graph have non–empty intersection.
متن کاملMaintaining Longest Paths in Cyclic Graphs
This paper reconsiders the problem of maintaining longest paths in directed graphs, which is at the core of many scheduling applications. It presents bounded incremental algorithms for arc insertion and deletion running in time O(‖δ‖ + |δ| log |δ|) on Cyclic< 0 graphs (i.e., graphs whose cycles have strictly negative lengths), where |δ| and ‖δ‖ are measures of the change in the input and output...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2016
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1502-32